On Complexity of Searching a Subset of Vectors with Shortest Average Under a Cardinality Restriction
نویسندگان
چکیده
منابع مشابه
The Distance Approach to Approximate Combinatorial Counting
We develop general methods to obtain fast (polynomial time) estimates of the cardinality of a combinatorially defined set via solving some randomly generated optimization problems on the set. Examples include enumeration of perfect matchings in a graph, linearly independent subsets of a set of vectors and colored spanning subgraphs of a graph. Geometrically, we estimate the cardinality of a sub...
متن کاملApproximation Solutions for Time-Varying Shortest Path Problem
Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...
متن کاملSets of Unit Vectors with Small Subset Sums
We say that a family {xi | i ∈ [m]} of vectors in a Banach space X satisfies the k-collapsing condition if ‖∑i∈I xi‖ ≤ 1 for all k-element subsets I ⊆ {1,2, . . . ,m}. Let C (k,d) denote the maximum cardinality of a k-collapsing family of unit vectors in a d-dimensional Banach space, where the maximum is taken over all spaces of dimension d. Similarly, let C B(k,d) denote the maximum cardinalit...
متن کاملComplete forcing numbers of polyphenyl systems
The idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as Latin squares, block designs and Steiner systems in combinatorics (see [1] and the references therein). Recently, the forcing on perfect matchings has been attracting more researchers attention. A forcing set of M is a subset of M contained...
متن کاملA Parallel Genetic Algorithm Based Method for Feature Subset Selection in Intrusion Detection Systems
Intrusion detection systems are designed to provide security in computer networks, so that if the attacker crosses other security devices, they can detect and prevent the attack process. One of the most essential challenges in designing these systems is the so called curse of dimensionality. Therefore, in order to obtain satisfactory performance in these systems we have to take advantage of app...
متن کامل